Large Granularity Cache Coherence for Intermittent Connectivity

نویسندگان

  • Lily B. Mummert
  • Mahadev Satyanarayanan
چکیده

To function in mobile computing environments, distributed file systems must cope with networks that are slow, intermittent, or both. Intermittence vitiates the effectiveness of callback-based cache coherence schemes in reducing client-server communication, because clients must validate files when connections are reestablished. In this paper we show how maintaining cache coherence at a large granularity alleviates this problem. We report on the implementation and performance of large granularity cache coherence for the Coda File System. Our measurements confirm the value of this technique. At 9.6 Kbps, this technique takes only 4 – 20% of the time required by two other strategies to validate the cache for a sample of Coda users. Even at this speed, the network is effectively eliminated as the bottleneck for cache validation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

VIPS: Simple Directory-Less Broadcast-Less Cache Coherence Protocol

Coherence in multicores introduces complexity and overhead (directory, state bits) in exchange for local caching, while being “invisible” to the memory consistency model. In this paper we show that a much simpler (directory-less/broadcast-less) multicore coherence provides almost the same performance without the complexity and overhead of a directory protocol. Motivated by recent efforts to sim...

متن کامل

Cooperative Cache Management in S2FS

S2FS, a descendant of NCIC's COSMOS file system prototype, is a single-image cluster file system, and good scalability is its main design goal. Reducing client-server communication and the number of disk accesses is critical for I/O scalability. Cooperative caching reduces the number of network hops and disk accesses considerably, however, the network must be used to maintain cache coherence. T...

متن کامل

Reconciling Sharing and Spatial Locality Using Adjustable Block Size Coherent Caches

Several studies have shown that the performance of coherent caches depends on the relationship between the cache block size and the granularity of sharing and locality exhibited by the program. Large cache blocks exploit processor and spatial locality, but may cause unnecessary cache invalidations due to false sharing. Small cache blocks can reduce the number of cache invalidations, but increas...

متن کامل

CMP Directory Coherence: One Granularity Does Not Fit All

Abstract To support legacy software, large CMPs often provide cache coherence via an on-chip directory rather than snooping. In those designs, a key challenge is maximizing the effectiveness of precious on-chip directory state. Most current directory protocols miss an opportunity by organizing all state in per-block records. To increase the "reach" of on-chip directory state, we apply ideas fro...

متن کامل

Region-level Tracking for Scalable Directory Cache

Traditional coherence directories track sharing information at a cache-line granularity. In practice, however, as data sharing occurs at a coarser granularity in a large region of memory, common sharing patterns tend to be observed across multiple proximate lines. Hence, the directory entries for the lines replicate the same sharing information, resulting in inefficient use of space, power, and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994